Sessions as Propositions
نویسندگان
چکیده
Recently, Wadler presented a continuation-passing translation from a session-typed functional language, GV, to a process calculus based on classical linear logic, CP. However, this translation is one-way: CP is more expressive than GV. We propose an extension of GV, called HGV, and give translations showing that it is as expressive as CP. The new translations shed light both on the original translation from GV to CP, and on the limitations in expressiveness of GV.
منابع مشابه
The Least Must Speak with the Greatest
We extend a propositions-as-types correspondence between linear logic and session types to include recursive sessions. Our extension takes least and greatest fixed points as dual, an idea well-known to theorists, but which has not previously appeared in the treatment of recursive sessions. We preserve the freedom from races, deadlock, and livelock that is a hallmark of the propositions-as-types...
متن کاملThe Role of the Scholars` Tradition in Formulating Moral Propositions, with an Emphasis on Muhaqqiq Isfahani`s View
The issue of the source of ethical value is one of the most important issues in the field of metaethics. Moral philosophers have come up with different perspectives on this issue. Some Islamic thinkers, including Muhaqqiqi Isfahani, have considered the rationals` tradition as the formulating cause for moral propositions. This research is intended to emphasize on the viewpoint of Muhaqqiqi Isfah...
متن کاملCongestion Control for Layered Multicast Transmission
– fulfill intra-session fairness, i.e. between different receivers of the same session; – fair towards TCP; – fulfill inter-sessions fairness, i.e. same throughputs (and not number of layers) to concurrent sessions. RÉSUMÉ. Le contrôle de congestion en transmission multipoint est rendu difficile par l’hétérogénéité des récepteurs. Une des propositions les plus élégantes et les plus efficaces es...
متن کاملLogic-Based Domain-Aware Session Types
In prior work, an interpretation of linear logic propositions as session types for communicating processes was proposed. In a concurrent setting, it defines a tight propositions-as-types/proofs-as-programs correspondence, in the style of the CurryHoward isomorphism. In this paper, we generalize such an interpretation by relying on a variant of intuitionistic linear logic with hybrid logic const...
متن کاملClassical Higher-Order Processes
Classical Processes (CP) is a calculus where the proof theory of classical linear logic types communicating processes with mobile channels, à la π -calculus. Its construction builds on a recent propositions as types correspondence between session types and propositions in linear logic. Desirable properties such as type preservation under reductions and progress come for free from the metatheory...
متن کامل